Extremal infinite graph theory
نویسنده
چکیده
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
منابع مشابه
On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines
We observe recent results on the applications of extremal graph theory to cryptography. Classical Extremal Graph Theory contains Erdős Even Circuite Theorem and other remarkable results on the maximal size of graphs without certain cycles. Finite automaton is roughly a directed graph with labels on directed arrows. The most important advantage of Turing machine in comparison with finite automat...
متن کاملBounding Functions and Rigid Graphs
A function f bounds graphs from above if there exists an infinite family of graph G, such that if G ∈ G then f(|VG|) = |EG| and for all nonempty subgraphs H of G we have that F (|VH |) ≥ |EH |. This paper considers the question: which functions bound graphs? keywords graphs, extremal graph theory AMS subject classification 05C99
متن کاملExtremal Oriented Graphs and Erdős-hajnal Conjecture
For a (finite or infinite) family L of oriented graphs, a new parameter called the compressibility number of L and denoted by z(L) is defined. The main motivation is the application of this parameter in a special case of Turán-type extremal problems for digraphs, in which it plays the role of chromatic number in the classic extremal problems. We estimate this parameter for some special group of...
متن کاملThe Cycle Space of an Infinite Graph
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of the unit circle in the space formed by the graph together with its ends. Our approach permits the extension to infinite graphs of standard results about fini...
متن کاملUndecidability of Linear Inequalities in Graph Homomorphism Densities
Many fundamental theorems in extremal graph theory can be expressed as algebraic inequalities between subgraph densities. As is explained below, for dense graphs, it is possible to replace subgraph densities with homomorphism densities. An easy observation shows that one can convert any algebraic inequality between homomorphism densities to a linear inequality. Inspired by the work of Freedman,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011